Existence of EF-equivalent non-isomorphic models

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existence of EF-equivalent non-isomorphic models

We prove the existence of pairs of models of the same cardinality λ which are very equivalent according to EF games, but not isomorphic. We continue the paper [4], but we don’t rely on it.

متن کامل

Ef Equivalent Not Isomorphic Pair of Models Sh907

We construct non-isomorphic models M,N , e.g. of cardinality א1 such that in the Ehrenfeucht-Fraissé game of any length ζ < ω1 the isomorphism player wins. Research supported by German-Israeli Foundation for Scientific Research and Development (Grant No.I-706-54.6/2001) I would like to thank Alice Leonhardt for the beautiful typing. First Typed 06/Oct/28 Latest Revision 08/Sept/25 Typeset by AM...

متن کامل

On the Number of L∞ω1-equivalent Non-isomorphic Models

We prove that if ZF is consistent then ZFC + GCH is consistent with the following statement: There is for every k < ω a model of cardinality א1 which is L∞ω1 -equivalent to exactly k non-isomorphic models of cardinality א1. In order to get this result we introduce ladder systems and colourings different from the “standard” counterparts, and prove the following purely combinatorial result: For e...

متن کامل

The number of L∞κ-equivalent non-isomorphic models for κ weakly compact

For a cardinal κ and a model M of cardinality κ let No(M) denote the number of non-isomorphic models of cardinality κ which are L∞,κequivalent to M . We prove that for κ a weakly compact cardinal, the question of the possible values of No(M) for models M of cardinality κ is equivalent to the question of the possible numbers of equivalence classes of equivalence relations which are Σ1-definable ...

متن کامل

Generating Functionally Equivalent Programs Having Non-isomorphic Control-Flow Graphs

One of the big challenges in program obfuscation consists in modifying not only the program’s straight-line code (SLC) but also the program’s control flow graph (CFG). Indeed, if only SLC is modified, the program’s CFG can be extracted and analyzed. Usually, the CFG leaks a considerable amount of information on the program’s structure. In this work we propose a method allowing to re-write a cod...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: MLQ

سال: 2007

ISSN: 0942-5616,1521-3870

DOI: 10.1002/malq.200610031